Stabilizing Queuing Networks With Model Data-Independent Control
نویسندگان
چکیده
Classical queuing network control strategies typically rely on accurate knowledge of model data, i.e., arrival and service rates. However, such data are not always available may be time-variant. To address this challenge, we consider a class data-independent (MDI) policies that only traffic state observation topology. In article, focus the MDI can stabilize multiclass Markovian networks under centralized decentralized policies. Control actions include routing, sequencing, holding. By expanding routes constructing piecewise-linear test functions, derive an easy-to-use criterion to check stability given policy. For stabilizable networks, show centralized, stabilizing policy exists. single-class further decentralized, addition, for both settings, construct explicit attain maximal throughput present numerical examples illustrate results.
منابع مشابه
A Queuing Model for Congestion Control and Reliable Data Transfer in Cable Access Networks
A set of simple queuing theory models which can model the average response of a network of computers to a given traffic load has been implemented. The impact of variations in traffic patterns and intensities, channel capacities, and message protocols can be assessed using them because of the lack of fine detail in the network traffic rates, traffic patterns, and the hardware used to implement t...
متن کاملQueuing Game Based Congestion Control Model with Impatient Users over Space Information Networks ?
Considering impatient users in space information networks, a preliminary queue congestion control model was presented. It balanced the network loads and make up for the resource lost from the impatient leaving users. To describe the competition among nodes, the model used queuing game theory. The introduced congestion control platform, which consisted of service nodes, calculated user’s gain to...
متن کاملStabilizing Maximal Independent Set in Unidirectional Networks is Hard
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this paper, we consider the problem of constructing self-stabilizingly a maximal independent set in uniform unidirectional networks of arbitrary shape. On the nega...
متن کاملAnalytical Model of Energy Consumption in Cluster based Wireless Sensor Networks with Data Aggregation using M/M/1 Queuing Model
Wireless Sensor Networks (WSNs) consist of several sensor nodes equipped with limited power sources that sense environments event and transmit data to the sink node. WSNs have many constraints including energy, redundant data, and many-to-one flows. Data aggregation is one of the most important issues for achieving energy-efficiency in wireless sensor networks. Sensor nodes in the surrounding r...
متن کاملA Robustly Stabilizing Model Predictive Control Algorithm
33 A model predictive control (MPC) algorithm that differs from prior MPC algorithms has been developed for controlling an uncertain nonlinear system. This algorithm guarantees the resolvability of an associated finite-horizon optimal-control problem in a recedinghorizon implementation. Given a feasible solution to the finite-horizon optimal control problem at an initial time, resolvability imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2022
ISSN: ['2325-5870', '2372-2533']
DOI: https://doi.org/10.1109/tcns.2022.3145752